New bounds on D-ary optimal codes
نویسندگان
چکیده
We propose a simple method that, given a symbol distribution, yields upper and lower bounds on the average code length of a D-ary optimal code over that distribution. Thanks to its simplicity, the method permits deriving analytical bounds for families of parametric distributions. We demonstrate this by obtaining new bounds, much better than the existing ones, for Zipf and exponential distributions when D > 2.
منابع مشابه
A class of q-ary linear codes derived from irreducible cyclic codes
Recently, linear codes with a few weights were widely investigated due to their applications in secret sharing schemes and authentication schemes. In this letter, we present a class of q-ary linear codes derived from irreducible cyclic codes with q a prime power. We use Gauss sums to represent its Hamming weights and obtain the bounds of its minimum Hamming distance. In some cases, we explicitl...
متن کاملOn Lower Bounds for the Redundancy of Optimal Codes
The problem of providing bounds on the redundancy of an optimal code for a discrete memoryless source in terms of the probability distribution of the source, has been extensively studied in the literature. The attention has mainly focused on binary codes for the case when the most or the least likely source letter probabilities are known. In this paper we analyze the relationships among tight l...
متن کاملNew Constructions for q-ary Covering Codes
Upper bounds on Kq (n; R), the minimum number of codewords in a q-ary code of length n and covering radius R, are improved. Such bounds are obtained by constructing corresponding covering codes. In particular, codes of length q + 1 are discussed. Good such codes can be obtained from maximum distance separable (MDS) codes. Furthermore, they can often be combined eeectively with other covering co...
متن کاملNew explicit binary constant weight codes from Reed-Solomon codes
Binary constant weight codes have important applications and have been studied for many years. Optimal or near-optimal binary constant weight codes of small lengths have been determined. In this paper we propose a new construction of explicit binary constant weight codes from q-ary ReedSolomon codes. Some of our binary constant weight codes are optimal or new. In particular new binary constant ...
متن کاملNew Results on D
For -ary -sequences, we develop the concept of similarity functions that can be used (for ) to model a thermodynamic similarity on DNA sequences. A similarity function is identified by the length of a longest common subsequence between two -ary -sequences. Codes based on similarity functions are called DNA codes [10]. DNA codes are important components in biomolecular computing and other biotec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 96 شماره
صفحات -
تاریخ انتشار 2005